منابع مشابه
A Fully Distributed (Minimal) Spanning Tree Algorithm
In this paper, we consider a connected undirected graph with n nodes. An asynchronous dist r ibuted algori thm is described which determines a spanning tree of the graph. Moreover, if the edges of the graph are weighted, the same algorithm can compute a minimum-weighted spanning tree. This algori thm can be favourably compared to the one of Gallagher et al. [6] in the following way: identical a...
متن کاملA Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G = (V, E, ω). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbi...
متن کاملA Formal Analysis of a Dynamic Distributed Spanning Tree Algorithm
We analyze the spanning tree algorithm in the IEEE 1394.1 draft standard, which correctness has not previously been proved. This algorithm is a fully-dynamic distributed graph algorithm, which, in general, is hard to develop. The approach we use is to formally develop an algorithm that is almost equivalent to it: First, based on a formal specification and an abstraction of the network, we syste...
متن کاملA Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
We present a new algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of any arbitrary positively real-weighted graph. We use a new fast linear time intermediate all-pairs shortest paths routing protocol. The resulting distributed algorithm is asynchronous, it works for arbitrary named network, and achieves O(n) time complexity and O(nm) message complexity.
متن کاملA Distributed Spanning Tree Algorithm for Topology-Aware Networks
A topology-aware network is a dynamic network in which the nodes can detect whether locally topology changes occur. Many modern networks, like IEEE 1394.1, are topology-aware networks. We present a distributed algorithm for computing and maintaining an arbitrary spanning tree in such a topology-aware network. Although usually minimal spanning trees are studied, in practice arbitrary spanning tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1987
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v16i226.7575